NONLINEAR q-ARY CODES: CONSTRUCTIONS AND MINIMUM DISTANCE COMPUTATION
نویسندگان
چکیده
A nonlinear code can be represented as the union of cosets of a linear subcode. Properties and constructions of new codes from given ones in terms of this representation can be described. Algorithms to compute the minimum distance of nonlinear codes, based on known algorithms for linear codes, are also established. Moreover, the performance of these algorithms is studied and an estimation of the number of enumerated codewords needed in the computations is given.
منابع مشابه
Constructions of q-ary entanglement-assisted quantum MDS codes with minimum distance greater than q+1
The entanglement-assisted stabilizer formalism provides a useful framework for constructing quantum error-correcting codes (QECC), which can transform arbitrary classical linear codes into entanglement-assisted quantum error correcting codes (EAQECCs) by using pre-shared entanglement between the sender and the receiver. In this paper, we construct five classes of entanglement-assisted quantum M...
متن کاملBounds for the $l_1$-distance of $q$-ary lattices obtained via Constructions D, D$^{'}$ and $\overline{D}$
Lattices have been used in several problems in coding theory and cryptography. In this paper we approach q-ary lattices obtained via Constructions D, D′ and D. It is shown connections between Constructions D and D′. Bounds for the minimum l1-distance of lattices ΛD, ΛD′ and ΛD and, under certain conditions, a generator matrix for ΛD′ are presented. In addition, when the chain of codes used is c...
متن کاملOn the admissible families of components of Hamming codes
In this paper, we describe the properties of the i-components of Hamming codes. We suggest constructions of the admissible families of components of Hamming codes. It is shown that every q-ary code of length m and minimum distance 5 (for q = 3 the minimum distance is 3) can be embedded in a q-ary 1-perfect code of length n = (qm−1)/(q−1). It is also shown that every binary code of length m+k an...
متن کاملNew q-ary quantum MDS codes with distances bigger than \(\frac{q}{2}\)
Constructions of quantum MDS codes have been studied by many authors. We refer to the table in page 1482 of [3] for known constructions. However there have been constructed only a few q-ary quantum MDS [[n, n−2d+2, d]]q codes with minimum distances d > q 2 for sparse lengths n > q + 1. In the case n = q 2 −1 m where m|q + 1 or m|q − 1 there are complete results. In the case n = q 2 −1 m while m...
متن کاملNew Constructions for q-ary Covering Codes
Upper bounds on Kq (n; R), the minimum number of codewords in a q-ary code of length n and covering radius R, are improved. Such bounds are obtained by constructing corresponding covering codes. In particular, codes of length q + 1 are discussed. Good such codes can be obtained from maximum distance separable (MDS) codes. Furthermore, they can often be combined eeectively with other covering co...
متن کامل